Square Root on Chip

نویسندگان

  • Borisav Jovanović
  • Milunka Damnjanović
چکیده

Three algorithm implementations for square root computation are considered in this paper. Newton-Raphson's, iterative, and binary search algorithm implementations are completely designed, verified and compared. The algorithms, entire system-on-chip realisations and their functioning are described.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Results on Pulse Shaping in DS-CDMA Systems

DS-CDMA is evaluated for rectangular pulse shaping and square root raised cosine pulses with different roll off factors. Rectangular pulses are found to be better even with close adjacent channels. With synchronization error in the order of 10% of a chip interval, square root raised cosine pulses outperform the rectangular pulse.

متن کامل

A Real-Time Marker-Based Visual Sensor Based on a FPGA and a Soft Core Processor

This paper introduces a real-time marker-based visual sensor architecture for mobile robot localization and navigation. A hardware acceleration architecture for post video processing system was implemented on a field-programmable gate array (FPGA). The pose calculation algorithm was implemented in a System on Chip (SoC) with an Altera Nios II soft-core processor. For every frame, single pass im...

متن کامل

Optimal Probing Patterns for Sequencing by Hybridization

Sequencing by Hybridization (SBH) is a method for reconstructing a DNA sequence based on its k-mer content. This content, called the spectrum of the sequence, can be obtained from hybridization with a universal DNA chip. The main shortcoming of SBH is that it reliably reconstructs only sequences of length at most square root of the size of the chip. Frieze et al. [9] showed that by using gapped...

متن کامل

On the square root of quadratic matrices

Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.

متن کامل

Fast Neural

This article is focused on implementation of neural networks in hardware. We give an overview of so-called shift-add neural arithmetics, which provides a complete set of functions suitable for fast perceptron and RBF neuron implementation. The functions use linear approximation to reach suucient simplicity. Since the linear approximation produces imprecise results, precision analysis and tests ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005